Co-evolutionary particle swarm optimization to solve constrained optimization problems
نویسندگان
چکیده
منابع مشابه
Application of Particle Swarm Optimization and Genetic Algorithm Techniques to Solve Bi-level Congestion Pricing Problems
The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...
متن کاملA Hybrid Co-evolutionary Particle Swarm Optimization Algorithm for Solving Constrained Engineering Design Problems
This paper presents an effective hybrid coevolutionary particle swarm optimization algorithm for solving constrained engineering design problems, which is based on simulated annealing (SA) , employing the notion of co-evolution to adapt penalty factors. By employing the SAbased selection for the best position of particles and swarms when updating the velocity in co-evolutionary particle swarm o...
متن کاملSolving Constrained Nonlinear Optimization Problems with Particle Swarm Optimization
This paper presents a Particle Swarm Optimization (PSO) algorithm for constrained nonlinear optimization problems. In PSO, the potential solutions, called particles, are "flown" through the problem space by learning from the current optimal particle and its own memory. In this paper, preserving feasibility strategy is employed to deal with constraints. PSO is started with a group of feasible so...
متن کاملUnified Particle Swarm Optimization for Solving Constrained Engineering Optimization Problems
We investigate the performance of the recently proposed Unified Particle Swarm Optimization method on constrained engineering optimization problems. For this purpose, a penalty function approach is employed and the algorithm is modified to preserve feasibility of the encountered solutions. The algorithm is illustrated on four well–known engineering problems with promising results. Comparisons w...
متن کاملDynamic-objective particle swarm optimization for constrained optimization problems
This paper firstly presents a novel constraint-handling technique , called dynamicobjective method (DOM), based on the search mechanism of the particles of particle swarm optimization (PSO). DOM converts the constrained optimization problem into a bi-objective optimization problem, and then enables each particle to dynamically adjust its objectives according to its current position in the searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2009
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2008.10.013